Basic Complexity
نویسندگان
چکیده
This paper summarizes a series of three lectures the first author was invited to present at the NZMRI summer 2000 workshop, held in Kaikoura, New Zealand. Lecture 1 presents the goals of computational complexity theory. We discuss (a) what complexity provably can never deliver, (b) what it hopes to deliver but thus far has not, and finally (c) where it has been extremely successful in providing useful theorems. In so doing, we introduce nondeterministic Turing machines. Lecture 2 presents alternation, a surprisingly-useful generalization of nondeterminism. Using alternation, we define more complexity classes, and inject clarity into a confusing situation. In Lecture 3 we present a few of the most beautiful results in computational complexity theory. In particular, we discuss (a) the algebraic approach to circuit complexity, (b) circuit lower bounds, and (c) derandomization.
منابع مشابه
Cognitive Task Complexity and Iranian EFL Learners’ Written Linguistic Performance across Writing Proficiency Levels
Recently tasks, as the basic units of syllabi, and the cognitive complexity, as the criterion for sequencing them, have caught many second language researchers’ attention. This study sought to explore the effect of utilizing the cognitively simple and complex tasks on high- and low-proficient EFL Iranian writers’ linguistic performance, i.e., fluency, accuracy, lexical complexity, and structura...
متن کاملMeasurement of Complexity and Comprehension of a Program Through a Cognitive Approach
The inherent complexity of the software systems creates problems in the software engineering industry. Numerous techniques have been designed to comprehend the fundamental characteristics of software systems. To understand the software, it is necessary to know about the complexity level of the source code. Cognitive informatics perform an important role for better understanding the complexity o...
متن کاملInvestigating the relationship among complexity, range, and strength of grammatical knowledge of EFL students
Assessment of grammatical knowledge is a rather neglected area of research in the field with many open questions (Purpura, 2004). The present research incorporates recent proposals about the nature of grammatical development to create a framework consisting of dimensions of complexity, range and strength, and studies which dimension(s) can best predict the stat...
متن کاملDeveloping a fuzzy group decision making approach for project manager selection considering the static complexity of construction projects
Due to the particular importance of projects in human life and in organizations, proper project management has been always regarded highly by researchers and practitioners. Recent advances in technology and fundamental changes in most scientific areas have affected projects and made their nature and environmental circumstances much more complex than in the past. Fortunately, in recent years, ma...
متن کاملUsing Nesterov\'s Excessive Gap Method as Basic Procedure in Chubanov\'s Method for Solving a Homogeneous Feasibility Problem
We deal with a recently proposed method of Chubanov [1], for solving linear homogeneous systems with positive variables. We use Nesterov's excessive gap method in the basic procedure. As a result, the iteration bound for the basic procedure is reduced by the factor $nsqrt{n}$. The price for this improvement is that the iterations are more costly, namely $O(n^2 )$ instead of $O(n)$. The overall ...
متن کاملImpact of Dynamic Assessment on the Writing Performance of English as Foreign Language Learners in Asynchronous Web 2.0 and Face-to-face Environments
This study sought to investigate dynamic assessment (DA) - an assessment approach that embeds inter- vention within the assessment process and that yields information about the learner’s responsiveness to this intervention - and the writing performance of the second language (L2) learners in Web 2.0 contexts. To this end, pre and post-treatment writings of 45 par...
متن کامل